منابع مشابه
EASI made Easier
Lewbel and Pendakur (2008) develop the idea of implicit Marshallian demands. Implicit Marshallian demand systems allow the incorporation of both unobserved preference heterogeneity and complex Engel curves into consumer demand analysis, circumventing the standard problems associated with combining rationality with either (or both) unobserved heterogeneity and high rank in demand. They also deve...
متن کاملMPIglut: Powerwall Programming Made Easier
A powerwall is an array of separate screens that work together to provide a single unified display. Powerwalls are often driven by a small cluster, which requires parallel software to organize and synchronize the distributed rendering process. This paper describes MPIglut, our powerwall-friendly implementation of the popular sequential GLUT OpenGL 3D programming interface. MPIglut internally co...
متن کاملQuantum Data and Control Made Easier
In this paper we define nQML, a functional quantum programming language that follows the “quantum data and control” paradigm. In comparison to Altenkirch and Grattage’s QML, the control constructs of nQML are simpler and can implement quantum algorithms more directly and naturally. We avoid the unnecessary complexities of a linear type system by using types that carry the address of qubits in t...
متن کاملOptimal Morphs of Planar Orthogonal Drawings
We describe an algorithm that morphs between two planar orthogonal drawings ΓI and ΓO of a connected graph G, while preserving planarity and orthogonality. Necessarily ΓI and ΓO share the same combinatorial embedding. Our morph uses a linear number of linear morphs (linear interpolations between two drawings) and preserves linear complexity throughout the process, thereby answering an open ques...
متن کاملConvexity-Increasing Morphs of Planar Graphs
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of a 3-connected graph G, we show how to morph the drawing to one with convex faces while maintaining planarity at all times. Furthermore, the morph is convexity increasing, meaning that angles of inner faces never change from convex to reflex. We give a polynomial time algorithm that construc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2023
ISSN: ['1526-1719']
DOI: https://doi.org/10.7155/jgaa.00616